A web basis of invariant polynomials from noncrossing partitions
نویسندگان
چکیده
The irreducible representations of symmetric groups can be realized as certain graded pieces invariant rings, equivalently global sections line bundles on partial flag varieties. There are various ways to choose useful bases such Specht modules Sλ. Particularly powerful web bases, which make important connections with cluster algebras and quantum link invariants. Unfortunately, only known in very special cases—essentially, the cases λ=(d,d) λ=(d,d,d). Building work B. Rhoades (2017), we construct an apparent basis polynomials for 2-parameter family λ form (d,d,1ℓ). planar diagrams that appear noncrossing set partitions, thereby obtain geometric interpretations earlier enumerative results combinatorial dynamics.
منابع مشابه
Polynomials, Meanders, and Paths in the Lattice of Noncrossing Partitions
For every polynomial f of degree n with no double roots, there is an associated family C(f) of harmonic algebraic curves, fibred over the circle, with at most n−1 singular fibres. We study the combinatorial topology of C(f) in the generic case when there are exactly n − 1 singular fibres. In this case, the topology of C(f) is determined by the data of an n-tuple of noncrossing matchings on the ...
متن کاملON k-NONCROSSING PARTITIONS
In this paper we prove a duality between k-noncrossing partitions over [n] = {1, . . . , n} and k-noncrossing braids over [n − 1]. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to tangled-diagrams [6]. We give a combinatorial interpretation of the bijection in terms of the contraction of arcs of tangled-diagrams. Furthermore it induces by re...
متن کاملOn the Noncrossing Partitions of a Cycle
This article defines the paritions of a finite set structured in a cycle which possesses the property that a pair of points belonging to a class and a pair of points belonging to another class cannot be in a crossed way. It establishes that these partitions form a lattice and it specifies some of the descriptive and enumerative properties of the lattice; it computes in particular the Möbius fun...
متن کاملPairs of noncrossing free Dyck paths and noncrossing partitions
Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2n and noncrossing partitions of [2n + 1] with n + 1 blocks. In terms of the number of up steps at odd positions, we find a characterization of Dyck paths constructed from pairs of noncrossing free Dyck paths by using the Labelle merging algorithm.
متن کاملNoncrossing partitions with fixed points
The noncrossing partitions with each of their blocks containing a given element are introduced and studied. The enumeration of these partitions is described through a polynomial of several variables which is proved to satisfy a recursive formula. It is shown that each variable increased by one is a factor of this polynomial.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2022
ISSN: ['1857-8365', '1857-8438']
DOI: https://doi.org/10.1016/j.aim.2022.108603